Chord-over-Chord Overlay for Peer-to-Peer networks

نویسنده

  • Sudhindra Rao
چکیده

In structured Peer-to-Peer(P2P) systems such as Chord or Pastry, each node plays an equal role and has the same responsibility. The most important advantage of such approach is scalability: since there are no centralized resources in the system, the system can easily scale to millions of nodes. However, we need to pay a high price for such scalability, as the maintenance cost of such protocols is very high, especially in a highly dynamic environment where nodes join and leave frequently. On the other hand, Napster-like P2P systems use some centralized index servers for information location and routing services. While such a solution does not scale as well as structured P2P systems, in reality they work very well, since the maintenance overhead is minimal, and the number of nodes handled by each index server in a real system is limited anyway. Can you design a solution that combines DHT and Napster-like architectures so the system is scalable and low-cost at the same time? It is OK to study previous solutions(if available) and make improvements on them. However if you choose to do so, you need to clearly point out this, and discuss the differences between your schemes and the previous ones.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

TAC: A Topology-Aware Chord-based Peer-to-Peer Network

Among structured Peer-to-Peer systems, Chord has a general popularity due to its salient features like simplicity, high scalability, small path length with respect to network size, and flexibility on node join and departure. However, Chord doesn’t take into account the topology of underlying physical network when a new node is being added to the system, thus resulting in high routing late...

متن کامل

Estimating the size of a Chord ring

The Chord system is a decentralized peer-to-peer mechanism designed to store and search key/value pairs. The peers in a Chord overlay network are represented on a circle, whereas each peer has to maintain log 2 (n) neighbors to guarantee a stable overlay structure in the presence of high churn rates. A single peer, however, does not know the current size n of the Chord ring. Choosing a constant...

متن کامل

Cross-layer Mobile Chord P2P protocol design for VANET

Efficient content distribution is one of the emerging applications in vehicular networks. To provide scalable content distribution in vehicular networks, Chord peer-to-peer overlay could be applied. Most P2P protocols, including Chord, are designed for wired-line network, and might perform poorly in mobile networks. Mobile Chord (MChord) is proposed to enhance the P2P performance over vehicular...

متن کامل

Survey-based Comparison of Chord Overlay Networks

Chord is a structured peer-to-peer (P2P) overlay network in which participating peers share resources as equals. To find a specific data item within the network, Chord system provide a lookup mechanism that matches a given key to a network node responsible for the value associated with that key. Chord is recently proposed to become one of the new approaches for building large-scale Internet app...

متن کامل

Investigation of Chord Protocol in Peer to Peer-Wireless Mesh Network with Mobility

File sharing in networks is generally achieved using Peer-to-Peer (P2P) applications. Structured P2P approaches are widely used in adhoc networks due to its distributed and scalability features. Efficient mechanisms are required to handle the huge amount of data distributed to all peers. The intrinsic characteristics of P2P system makes for easier content distribution when compared to client-se...

متن کامل

The Hybrid Chord Protocol: A Peer-to-Peer Lookup Service for Context-Aware Mobile Applications

A fundamental problem in Peer-to-Peer (P2P) overlay networks is how to efficiently find a node that shares a requested object. The Chord protocol is a distributed lookup protocol addressing this problem using hash keys to identify the nodes in the network and also the shared objects. However, when a node joins or leaves the Chord ring, object references have to be rearranged in order to maintai...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004